منابع مشابه
Random Walks and Chemical Networks
We consider continuous-time random walks with bounded jumps but unbounded rates (they depend polynomially on coordinates in the orthant). In applications, the case when the rates are bounded corresponds in applications to queueing theory, more precisely, to Markovian communication networks. The goal of this paper is to discuss the situation for polynomial rates; we show that the boundaries ofte...
متن کاملChemical Continuous Time Random Walks.
Kinetic Monte Carlo methods such as the Gillespie algorithm model chemical reactions as random walks in particle number space. The interreaction times are exponentially distributed under the assumption that the system is well mixed. We introduce an arbitrary interreaction time distribution, which may account for the impact of incomplete mixing on chemical reactions, and in general stochastic re...
متن کاملRandom walks and electric networks
∗Copyright (C) 1999, 2000, 2006 Peter G. Doyle and J. Laurie Snell. Derived from their Carus Monograph, Copyright (C) 1984 The Mathematical Association of America. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, as published by the Free Software Foundation; with no Invariant Sections, no Front-Cover Texts, and no Back-...
متن کاملRandom Walks and Chemical Graph Theory
Simple random walks probabilistically grown step by step on a graph are distinguished from walk enumerations and associated equipoise random walks. Substructure characteristics and graph invariants correspondingly defined for the two types of random walks are then also distinct, though there often are analogous relations. It is noted that the connectivity index as well as some resistance-distan...
متن کاملRandom Walks between Leaves of Random Networks
We consider random walks that start and are absorbed on the leaves of random networks and study the length of such walks. For the networks we investigate, Erdős-Rényi random graphs and Barabási-Albert scale free networks, these walks are not transient and we consider various approaches to computing the probability of a given length walk. One approach is to label nodes according to both their to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Moscow Mathematical Journal
سال: 2004
ISSN: 1609-3321,1609-4514
DOI: 10.17323/1609-4514-2004-4-2-441-453